منابع مشابه
Voting with rubber bands, weights, and strings
We introduce some new voting rules based on a spatial version of the median in R known as the mediancentre, or Fermat-Weber point. Voting rules based on the mean include many that are familiar: the Borda Count, Kemeny rule, approval voting, etc. (see [35], [36]). These mean rules can be implemented by “voting machines” (interactive simulations of physical mechanisms) that use ideal rubber bands...
متن کاملRubber Bands, Pursuit Games and Shy Couplings
In this paper, we consider pursuit-evasion and probabilistic consequences of some geometric notions for bounded and suitably regular domains in Euclidean space that are CAT(κ) for some κ > 0. These geometric notions are useful for analyzing the related problems of (a) existence/nonexistence of successful evasion strategies for the Man in Lion and Man problems, and (b) existence/nonexistence of ...
متن کاملRubber bands, convex embeddings and graph connectivity
We give various characterizations of k-vertex connected graphs by geometric, algebraic, and "physical" properties. As an example, a graph G is k-connected ff and only if, specifying any k vertices of G, the vertices of G can be represented by points of R ~-a so that no k are on a hyper-. plane and each vertex is in the convex hull of its neighbors, except for the k specified vertices. The proof...
متن کامل3D Shape from Anisotropic Diffusion
We cast the problem of inferring the 3D shape of a scene from a collection of defocused images in the framework of anisotropic diffusion. We propose a novel algorithm that can estimate the shape of a scene by inferring the diffusion coefficient of a heat equation. The method is optimal, as we pose it as the minimization of a certain cost functional based on the input images, and fast. Furthermo...
متن کاملBayesian 3D shape from silhouettes
This paper introduces a smooth posterior density function for inferring shapes from silhouettes. Both the likelihood and the prior are modelled using Kernel Density functions and optimisation is performed using gradient ascent algorithms. Adding a prior allows for the recovery of concave areas of the shape that are usually lost when estimating the visual hull. This framework is also extended to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Materials Today
سال: 2014
ISSN: 1369-7021
DOI: 10.1016/j.mattod.2014.06.019